On cluster resource allocation for multiple parallel task graphs
نویسندگان
چکیده
منابع مشابه
On cluster resource allocation for multiple parallel task graphs
Many scientific applications can be structured as Parallel Task Graphs (PTGs), that is, graphs of data-parallel tasks. Adding data-parallelism to a task-parallel application provides opportunities for higher performance and scalability, but poses additional scheduling challenges. In this paper, we study the off-line scheduling of multiple PTGs on a single, homogeneous cluster. The objective is ...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملResource Allocation on Dynamic Con ict Graphs
The sharing of resources among processes in a distributed system leads to a connict graph that may change with time. Resource allocation over a static connict graph (also called the dining philosophers problem) has been studied extensively. We seek to solve resource allocation on dynamic connict graphs by using existing algorithms that work only for static connict graphs. In the process we deen...
متن کاملSpeculation-aware Resource Allocation for Cluster Schedulers
Resource allocation and straggler mitigation (via “speculative” copies) are two key building blocks for analytics frameworks. Today, the two solutions are largely decoupled from each other, losing the opportunities of joint optimization. Resource allocation across jobs assumes that each job runs a fixed set of tasks, ignoring their need to dynamically run speculative copies for stragglers. Cons...
متن کاملResource Allocation for Steerable Parallel Parameter Searches
Computational Grids lend themselves well to parameter sweep applications, which consist of independent tasks, each of which calculates results for a separate point in parameter space. However, it is possible for a parameter space to become so large as to pose prohibitive system requirements. In these cases, user-directed steering promises to reduce overall computation time. In this paper, we ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2010
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.08.017